package bintree.LeetCode;
//104. 二叉树的最大深度

public class Num104_maxDepth {

    public int maxDepth(TreeNode root) {
        if(root == null){
            return 0;
        }

        return 1 + Math.max(maxDepth(root.left), maxDepth(root.right));
    }

}
